Parameterized coherence measure

Parameterized Cache Coherence Protocol Verification using Invariant

Verification of parameterized cache coherence protocol is very important in the share-memory multiprocessor system. In this paper, a new method was proposed to verify the correctness of parameterized cache coherence protocol based on the invariant. Firstly, we present the parameterized cache coherence protocol as semi-algebraic transition system, and then solve the invariant of transition syste...

Automatic Verification of Parameterized Cache Coherence Protocols

Trace distance measure of coherence

We show that trace distance measure of coherence is a strong monotone for all qubit and, so called, X states. An expression for the trace distance coherence for all pure states and a semi definite program for arbitrary states is provided. We also explore the relation between l1-norm and relative entropy based measures of coherence, and give a sharp inequality connecting the two. In addition, it...

Rapid Parameterized Model Checking of Snoopy Cache Coherence Protocols

A new method is proposed for parameterized reasoning about snoopy cache coherence protocols. The method is distinctive for being exact (sound and complete), fully automatic (algorithmic), and tractably efficient. The states of most cache coherence protocols can be organized into a hierarchy reflecting how tightly a memory block in a given cache state is bound to the processor. A broad framework...

A Simple Method for Parameterized Verification of Cache Coherence Protocols

We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The first example describes in intuitive terms how the German protocol with arbitrarily many nodes can be verified using a combination of Murphi model checking and apparently circular reasoning. The second example outlines a similar ...